#define _CRT_SECURE_NO_WARNINGS 1

#include "sort.h"

void SelectTest()
{
	int a[10] = { 10,9,8,7,6,5,4,3,2,1 };
	SelectSort(a, 10);
	for (int i = 0;i < 10;++i)
	{
		printf("%d ", a[i]);
	}
}

void Heaptest()
{
	int a[4] = { 5,2,3,1 };
	HeapSort(a, 4);
	for (int i = 0;i < 4;++i)
	{
		printf("%d ", a[i]);
	}
}

void InsertTest()
{
	int a[10] = { 10,9,8,7,6,5,4,3,2,1 };
	InsertSort(a, 10);
	for (int i = 0;i < 10;++i)
	{
		printf("%d ", a[i]);
	}
}

void ShellTest()
{
	int a[10] = { 10,9,8,7,6,5,4,3,2,1 };
	ShellSort(a, 10);
	for (int i = 0;i < 10;++i)
	{
		printf("%d ", a[i]);
	}
}

void BubbleTest()
{
	int a[10] = { 10,9,8,7,6,5,4,3,2,1 };
	BubbleSort(a, 10);
	for (int i = 0;i < 10;++i)
	{
		printf("%d ", a[i]);
	}
}

void QuickTest()
{
	int a[10] = { 10,9,8,7,6,5,4,3,2,1 };
	QuickSortNonR(a, 0, 9);
	for (int i = 0;i < 10;++i)
	{
		printf("%d ", a[i]);
	}
}

void MergeTest()
{
	int a[3] = { -2,3,-5 };
	MergeSortNonR(a, 3);
	for (int i = 0;i < 3;++i)
	{
		printf("%d ", a[i]);
	}
}

void CountTest()
{
	int a[10] = { 10,9,8,7,6,5,4,3,2,1 };
	CountSort(a, 10);
	for (int i = 0;i < 10;++i)
	{
		printf("%d ", a[i]);
	}
}

int main()
{
	//SelectTest();
	//Heaptest();
	//InsertTest();
	//ShellTest();
	//BubbleTest();
	//QuickTest();
	//MergeTest();
	int a[10];
	printf("%d",a[10]);
	return 0;
}